Composite Documents and Uncertain Inference

نویسندگان

  • Thomas Rölleke
  • Norbert Fuhr
چکیده

The composite nature of multimedia documents requires a more powerful knowledge representation for indexing than the pure set of terms. Object-oriented data modeling is a widely known and accepted approach to represent knowledge. [Meghini et al. 93] introduces the usage of object-oriented principles in combination with logic for improving information retrieval. This workshop contribution presents ideas to combine uncertain inference with object-oriented modeling in order to achieve a suitable model for multimedia information retrieval. This work introduces the probabilistic extension of the model presented in [Rölleke & Fuhr 96]. Figure 1 depicts the major issues of the model. The documents d1 andd2 consists of words and sections. The square brackets indicate the composite (aggregated) structure of documents. This concept of aggregation allows for reflecting the composite nature of multimedia documents appropriately. In addition, it is suitable for modeling retrieval among distributed environments as indicated by the two databases db1 and db2. We consider databases, documents, and sections as contexts which define a local frame for a logical program. A logical program is a set of facts and rules for defining a set of propositions. Following the object-oriented principles, we consider three types of propositions, namely classification, generalization, and roles. Classification serves to group objects within certain classes (concepts). For example, document d1 states that object peter is an instance of class sailor. Generalization serves to define class hierarchies. For example, every picture is a document. Roles represent the relationships between objects. For example, mary is the author of d1. In addition, our model allows to use a predicate with arity zero (e. g. sailing). This corresponds to the classical set of terms approach and provides the familiar way for describing the content of documents.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Probabilistic Datalog

In [Fuhr 95], we have proposed probabilistic Datalog (pD) as an inference engine for IR. However, a closer look at pD shows that it handles conditional probabilities only in a rather limited way, since it neither allows for the speci cation of conditional probabilities in rules nor is it able to compute conditional probabilities. Given that probabilistic IR should be interpreted as computing th...

متن کامل

From Uncerrtain Inference to Agent-Based Information Retrieval

The logical approach to information retrieval (IR) treats retrieval as uncertain inference. In advanced applications, we have to deal with a multi-step inference process involving different system components: information needs, search activities, queries, query intermediaries, databases and documents. In order to provide a better system support for satisfying a user's information need, these co...

متن کامل

Information Retrieval with Probabilistic Datalog

The probabilistic logical approach in Information Retrieval (IR) aims at describing the retrieval process as the computation of the probability P (d! q) that a document d implies a query q. Probabilistic Datalog (DatalogP ) is a logic that enables uncertain inference. We use DatalogP as a platform for investigating the probabilistic logical approach in IR. The expressiveness of DatalogP allows ...

متن کامل

Language Models and Uncertain Inference in Information Retrieval

In the logical view on IR systems, retrieval is interpreted as implication [Rijsbergen 86]: Let d denote a document (represented as logical formula) and q a query, then retrieval deals with the task of finding those documents which imply the query, i.e. for which the formula d → q is true. Due to the intrinsic uncertainty and vagueness of IR, we have to switch to uncertain inference. Using a pr...

متن کامل

Towards Data Abstraction in NetworkedInformation Retrieval

Networked information retrieval aims at the interoperability of heterogeneous information retrieval (IR) systems. In this paper, we show how diier-ences concerning search operators and database schemas can be handled by applying data abstraction concepts in combination with uncertain inference. Diierent data types with vague predicates are required to allow for queries referring to arbitrary at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996